Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size
نویسنده
چکیده
It is known that any chordal graph can be uniquely decomposed into simplicial components. Based on this fact, it is shown that for a given chordal graph, its automorphism group can be computed in O((c! · n)O(1)) time, where c denotes the maximum size of simplicial components and n denotes the number of nodes. It is also shown that isomorphism of those chordal graphs can be decided within the same time bound. From the viewpoint of polynomial-time computability, our result strictly strengthens the previous ones respecting the clique number. key words: chordal graph, simplicial component, automorphism, isomorphism, computational group theory, algorithm, computational complexity
منابع مشابه
Complexity of simplicial homology and independence complexes of chordal graphs
We prove the NP-hardness of computing homology groups of simplicial complexes when the size of the input complex is measured by the number of maximal faces or the number of minimal non-faces. The latter case implies NP-hardness of the homology problem for clique and independence complexes of graphs. Our approach is based on the observation that the homology of an independence complex of a chord...
متن کاملComputing Szeged index of graphs on triples
ABSTRACT Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The Szeged index of G is defined by where respectively is the number of vertices of G closer to u (respectively v) than v (respectively u). If S is a set of size let V be the set of all subsets of S of size 3. Then we define t...
متن کاملVertex Decomposable Simplicial Complexes Associated to Path Graphs
Introduction Vertex decomposability of a simplicial complex is a combinatorial topological concept which is related to the algebraic properties of the Stanley-Reisner ring of the simplicial complex. This notion was first defined by Provan and Billera in 1980 for k-decomposable pure complexes which is known as vertex decomposable when . Later Bjorner and Wachs extended this concept to non-pure ...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملBETTI NUMBERS OF CHORDAL GRAPHS AND f-VECTORS OF SIMPLICIAL COMPLEXES
Let G be a chordal graph and I(G) its edge ideal. Let β(I(G)) = (β0, β1, . . . , βp) denote the Betti sequence of I(G), where βi stands for the ith total Betti number of I(G) and where p is the projective dimension of I(G). It will be shown that there exists a simplicial complex ∆ of dimension p whose f -vector f(∆) = (f0, f1, . . . , fp) coincides with β(I(G)).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 89-D شماره
صفحات -
تاریخ انتشار 2006